The definition of a random sequence of qubits: from Noncommutative Algorithmic Probability Theory to Quantum Algorithmic Information Theory and back
نویسنده
چکیده
for their friendship, for many invaluable remarks about the issues discussed in this paper. .. and for their trial of teaching me the style of work of Rigorous Mathematical Physics. for precious observations and suggestions. They all have no responsibility for any mistake contained in these pages.
منابع مشابه
Probabilistic Sufficiency and Algorithmic Sufficiency from the point of view of Information Theory
Given the importance of Markov chains in information theory, the definition of conditional probability for these random processes can also be defined in terms of mutual information. In this paper, the relationship between the concept of sufficiency and Markov chains from the perspective of information theory and the relationship between probabilistic sufficiency and algorithmic sufficien...
متن کاملNoncommutative Martin-Lof randomness : on the concept of a random sequence of qubits
Martin-Lof’s definition of random sequences of cbits as those not belonging to any set of constructive zero Lebesgue measure is reformulated in the language of Algebraic Probability Theory. The adoption of the Pour-El Richards theory of computability structures on Banach spaces allows us to give a natural noncommutative extension of Martin-Lof’s definition , characterizing the random elements o...
متن کاملAcceptable random variables in non-commutative probability spaces
Acceptable random variables are defined in noncommutative (quantum) probability spaces and some of probability inequalities for these classes are obtained. These results are a generalization of negatively orthant dependent random variables in probability theory. Furthermore, the obtained results can be used for random matrices.
متن کامل3D Scene and Object Classification Based on Information Complexity of Depth Data
In this paper the problem of 3D scene and object classification from depth data is addressed. In contrast to high-dimensional feature-based representation, the depth data is described in a low dimensional space. In order to remedy the curse of dimensionality problem, the depth data is described by a sparse model over a learned dictionary. Exploiting the algorithmic information theory, a new def...
متن کاملK-trivial, K-low and MLR-low Sequences: A Tutorial
A remarkable achievement in algorithmic randomness and algorithmic information theory was the discovery of the notions of K-trivial, K-low and MartinLöf-random-low sets: three different definitions turns out to be equivalent for very non-trivial reasons. This paper, based on the course taught by one of the authors (L.B.) in Poncelet laboratory (CNRS, Moscow) in 2014, provides an exposition of t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره quant-ph/0009009 شماره
صفحات -
تاریخ انتشار 2000